Periodic Permutations and the Robinson–schensted Correspondence
نویسندگان
چکیده
We introduce a group of periodic permutations, a new version of the infinite symmetric group. We then generalize and study the Robinson–Schensted correspondence for such permutations.
منابع مشابه
Minimal and maximal elements in two-sided cells of Sn and Robinson-Schensted correspondence
In symmetric groups, a two-sided cell is the set of all permutations which are mapped by the Robinson-Schensted correspondence on a pair of tableaux of the same shape. In this article, we show that the set of permutations in a two-sided cell which have a minimal number of inversions is the set of permutations which have a maximal number of inversions in conjugated Young subgroups. We also give ...
متن کاملEvacuation and a geometric construction for Fibonacci tableaux
Tableaux have long been used to study combinatorial properties of permutations and multiset permutations. Discovered independently by Robinson and Schensted and generalized by Knuth, the Robinson-Schensted correspondence has provided a fundamental tool for relating permutations to tableaux. In 1963, Schützenberger defined a process called evacuation on standard tableaux which gives a relationsh...
متن کاملProperties of the nonsymmetric Robinson-Schensted-Knuth algorithm
We introduce a generalization of the Robinson-Schensted-Knuth algorithm to composition tableaux involving an arbitrary permutation. If the permutation is the identity our construction reduces to Mason’s original composition Robinson-Schensted-Knuth algorithm. In particular we develop an analogue of Schensted insertion in our more general setting, and use this to obtain new decompositions of the...
متن کاملApplications of Symmetric Functions to Cycle and Increasing Subsequence Structure after Shuffles
Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after iterations of various shuffling methods. We emphasize the role of Cauchy type identities and variations of the Robinson-Schensted-Knuth correspondence.
متن کاملEnumerating rc-Invariant Permutations with No Long Decreasing Subsequences∗
We use the Robinson-Schensted-Knuth correspondence and Schützenberger’s evacuation of standard tableaux to enumerate permutations and involutions which are invariant under the reverse-complement map and which have no decreasing subsequences of length k. These enumerations are in terms of numbers of permutations with no decreasing subsequences of length approximately k2 ; we use known results co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003